Raising Permutations to Powers in Place

Given a permutation of n elements, stored as an array, we address the problem of replacing the permutation by its kth power. We aim to perform this operation quickly using o(n) bits of extra storage. To this end, we first present an algorithm for inverting permutations that uses O(lg2 n) additional bits and runs in O(n lgn) worst case time. This result is then generalized to the situation in which the permutation is to be replaced by its kth power. An algorithm whose worst case running time is O(n lgn) and uses O(lg2 n+min{k lgn, n3/4+ }) additional bits is presented. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems